Model Checking of Linear-Time Properties Based on Possibility Measure
نویسندگان
چکیده
منابع مشابه
Quantitative Model Checking of Linear-Time Properties Based on Generalized Possibility Measures
Model checking of linear-time properties based on possibility measures was studied in previous work (Y. Li and L. Li, Model checking of linear-time properties based on possibility measure, IEEE Transactions on Fuzzy Systems, 21(5)(2013), 842-854). However, the linear-time properties considered in the previous work was classical and qualitative, possibility information of the systems was not con...
متن کاملModel-checking Inherently Fair Linear-time Properties
The concept of linear-time verification with an inherent fairness condition has been studied under the names approximate satisfaction, satisfaction up to liveness, and satisfaction within fairness in several publications. Even though proving the general applicability of the approach, reasonably efficient algorithms for inherently fair linear-time verification (IFLTV) are lacking. This paper bri...
متن کاملBFS-Based Model Checking of Linear-Time Properties with an Application on GPUs
Efficient algorithms have been developed to model check liveness properties, such as the well-known Nested Depth-First Search, which uses a depth-first search (DFS) strategy. However, in some settings, DFS is not a suitable option. For instance, when considering distributed model checking on a cluster, or many-core model checking using a Graphics Processing Unit (GPU), Breadth-First Search (BFS...
متن کاملModel-Checking of Linear-Time Properties in Multi-Valued Systems
In this paper, we study model-checking of linear-time properties in multi-valuedsystems. Safety property, invariant property, liveness property, persistence anddual-persistence properties in multi-valued logic systems are introduced. Somealgorithms related to the above multi-valued linear-time properties are discussed.The verification of multi-valued regular safety properties an...
متن کاملRobust Model-Checking of Linear-Time Properties in Timed Automata
Formal verification of timed systems is well understood, but their implementation is still challenging. Raskin et al. have recently brought out a model of parameterized timed automata in which the transitions might be slightly delayed or expedited. This model is used to prove that a timed system is implementable with respect to a safety property, by proving that the parameterized model robustly...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Fuzzy Systems
سال: 2013
ISSN: 1063-6706,1941-0034
DOI: 10.1109/tfuzz.2012.2232298